Sparse topical analysis of dyadic data using matrix tri-factorization
نویسندگان
چکیده
منابع مشابه
Sparse Matrix Factorization of Gene Expression Data
Motivation: Gene expression data consists of expression level reads for thousands of genes across dozens of experimental conditions, time points, cell types or repeated experiments. The goal of unsupervised modeling of such data is to find some underlying organization, structure or redundancy in the data, such as similarity or dependency between genes or between experiments. Such structure can ...
متن کاملOnline Prediction of Dyadic Data with Heterogeneous Matrix Factorization
Dyadic Data Prediction (DDP) is an important problem in many research areas. This paper develops a novel fully Bayesian nonparametric framework which integrates two popular and complementary approaches, discrete mixed membership modeling and continuous latent factor modeling into a unified Heterogeneous Matrix Factorization (HeMF) model, which can predict the unobserved dyadics accurately. The ...
متن کاملTraffic Scene Analysis using Hierarchical Sparse Topical Coding
Analyzing motion patterns in traffic videos can be exploited directly to generate high-level descriptions of the video contents. Such descriptions may further be employed in different traffic applications such as traffic phase detection and abnormal event detection. One of the most recent and successful unsupervised methods for complex traffic scene analysis is based on topic models. In this pa...
متن کاملUsing underapproximations for sparse nonnegative matrix factorization
Nonnegative Matrix Factorization (NMF) has gathered a lot of attention in the last decade and has been successfully applied in numerous applications. It consists in the factorization of a nonnegative matrix by the product of two low-rank nonnegative matrices: M ≈ VW . In this paper, we attempt to solve NMF problems in a recursive way. In order to do that, we introduce a new variant called Nonne...
متن کاملSparse Matrix Factorization
We investigate the problem of factoring a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where finding a factorization corresponds to finding edges in different layers and also values of hidden units. We prove that under certain assumptions on a sparse li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2015
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-015-5537-5